Associative idempotent nondecreasing functions are reducible

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Nondecreasing Lyapunov functions

We propose the notion of nondecreasing Lyapunov functions which can be used to prove stability or other properties of the system in question. This notion is in particular useful in studying switched or hybrid systems. We illustrate the concept by a general construction of such a nondecreasing Lyapunov function for a class of planar hybrid systems. It is noted that this class encompasses switche...

متن کامل

Spectral Lattices of Reducible Matrices over Completed Idempotent Semifields

Previous work has shown a relation between L-valued extensions of FCA and the spectra of some matrices related to L-valued contexts. We investigate the spectra of reducible matrices over completed idempotent semifields in the framework of dioids, naturally-ordered semirings, that encompass several of those extensions. Considering special sets of eigenvectors also brings out complete lattices in...

متن کامل

Unification of Idempotent Functions

For a l m o s t as l o n g as a t t e m p t s a t p r o v i n g theorems by mach ines have been made, a c r i t i c a l p r o b l e m has been w e l l known: E q u a t i o n a l a x i o m s , i f l e f t w i t h o u t p r e c a u t i o n s i n t he d a t a base o f a n a u t o m a t i c t heo rem p r o v e r (ATP) , w i l l f o r c e the ATP t o g o a s t r a y . Four approaches t o cope w i t ...

متن کامل

Are Dispositions Reducible?

Although this definition is open to decisive objections, most of which are not new, NCA is not yet dead. There are still those of us who ask, on the presupposition that NCA or something very similar is the correct analysis of dispositions, whether dispositions can explain their manifestations, or whether the bearers of nothing but dispositional properties can fill space, or whether colours are ...

متن کامل

Orness For Idempotent Aggregation Functions

Aggregation functions are mathematical operators that merge given data in order to obtain a global value that preserves the information given by the data as much as possible. In most practical applications, this value is expected to be between the infimum and the supremum of the given data, which is guaranteed only when the aggregation functions are idempotent. Ordered weighted averaging (OWA) ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Semigroup Forum

سال: 2018

ISSN: 0037-1912,1432-2137

DOI: 10.1007/s00233-018-9973-y